Deterministic Approximations of Random Reflectors
نویسنده
چکیده
Within classical optics, one may add microscopic “roughness” to a macroscopically flat mirror so that parallel rays of a given angle are reflected at different outgoing angles. Taking the limit (as the roughness becomes increasingly microscopic) one obtains a flat surface that reflects randomly, i.e., the transition from incoming to outgoing ray is described by a probability kernel (whose form depends on the nature of the microscopic roughness). We consider two-dimensional optics (a.k.a. billiards) and show that every random reflector on a line that satisfies a necessary measure-preservation condition (well established in the theory of billiards) can be approximated by deterministic reflectors in this way.
منابع مشابه
Stability of random attractors under perturbation and approximation
The comparison of the long-time behaviour of dynamical systems and their numerical approximations is not straightforward since in general such methods only converge on bounded time intervals. However, one can still compare their asymptotic behaviour using the global attractor, and this is now standard in the deterministic autonomous case. For random dynamical systems there is an additional prob...
متن کاملIterative Deterministic Equivalents for the Performance Analysis of Communication Systems
In this article, we introduce iterative deterministic equivalents as a novel technique for the performance analysis of communication systems whose channels are modeled by complex combinations of independent random matrices. This technique extends the deterministic equivalent approach for the study of functionals of large random matrices to a broader class of random matrix models which naturally...
متن کاملA Priori Error Analysis of Stochastic Galerkin Mixed Approximations of Elliptic PDEs with Random Data
We construct stochastic Galerkin approximations to the solution of a first-order system of PDEs with random coefficients. Under the standard finite-dimensional noise assumption, we transform the variational saddle point problem to a parametric deterministic one. Approximations are constructed by combining mixed finite elements on the computational domain with M -variate tensor product polynomia...
متن کاملMixtures of Polynomials in Hybrid Bayesian Networks with Deterministic Variables
The main goal of this paper is to describe inference in hybrid Bayesian networks (BNs) using mixtures of polynomials (MOP) approximations of probability density functions (PDFs). Hybrid BNs contain a mix of discrete, continuous, and conditionally deterministic random variables. The conditionals for continuous variables are typically described by conditional PDFs. A major hurdle in making infere...
متن کاملA Deterministic Equivalent Approach to the Performance Analysis of Isometric Random Precoded Systems
In this work, a general wireless channel model for different types of code-division multiple access (CDMA) and space-division multiple-access (SDMA) systems with isometric random signature or precoding matrices over frequency-selective and flat fading channels is considered. For such models, deterministic approximations of the mutual information and the signal-to-interference-plus-noise ratio (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012